Reliable operations on oscillatory functions
نویسندگان
چکیده
منابع مشابه
. N A ] 1 4 M ay 1 99 9 Reliable Operations on Oscillatory Functions
Approximate p-point Leibniz derivation formulas as well as interpolatory Simpson quadrature sums adapted to oscillatory functions are discussed. Both theoretical considerations and numerical evidence concerning the dependence of the discretization errors on the frequency parameter of the oscillatory functions show that the accuracy gain of the present formulas over those based on the
متن کاملBasic Functions and Operations on Functions
We define the following mappings: the characteristic function of a subset of a set, the inclusion function (injection or embedding), the projections from a Cartesian product onto its arguments and diagonal function (inclusion of a set into its Cartesian square). Some operations on functions are also defined: the products of two functions (the complex function and the more general product-functi...
متن کاملEffective operations on partial functions
Once we have studied effectively computable operations on numbers it is natural to ask whether there is a comparable notion for operations on functions. The essential difference between functions and numbers as basic objects is that functions are usually infinite rather than finite. With this in mind, in §1 of this chapter we discuss the features we might reasonably expect of an effective opera...
متن کاملToward Reliable Polygon Set Operations
Polygon intersection (clipping) and difference are among the most fundamental operations in computer graphics. To the uninitiated, these problems appear trivial; in fact, they are extremely difficult to perform reliably by computer. Although the graphics literature already provides algorithms for polygon set operations, they have two significant weaknesses: (1) they may fail because they are sp...
متن کاملReference Variables for Dynamic, Reliable Packet Operations
A classic ‘reference’ variable provides an indirect way to access a variable or aggregate. packetC, [1] a language for network packet processing, has specialized requirements for references that apply to aggregates, based on domain-specific, extended data types. The primary functional requirement is to defer selecting particular aggregates until runtime. In addition, requirements for high progr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2000
ISSN: 0010-4655
DOI: 10.1016/s0010-4655(99)00468-3